Chinese Remainder Theorem
Enter number $a_1$:
Enter number $m_1$:
Enter number $a_2$:
Enter number $m_2$:
Solve $x \equiv a_1 \left( \bmod m_1 \right), x \equiv a_2 \left( \bmod m_2 \right)$